Implementing the eODL Graphical Representation
نویسندگان
چکیده
eODL is the ITU component description language. Its current status is that it is defined textually and there are several transformation into other languages. There are also ideas about a graphical representation for eODL. In this article we present a graphical representation for some of the eODL language elements and discuss how such a graphical representation can be implemented using a high-level formal description language in comparison with a UML profile.
منابع مشابه
Component Development: MDA Based Transformation from eODL to CIDL
The development of software systems in general and software components in particular becomes a more and more challenging task. The key solution for handling the complexity in the development process is modeling of software systems and the transformation into implementation. The authors show an application of OMG’s Model Driven Architecture (MDA) in the context of component development, where di...
متن کاملStudy of Solute Dispersion with Source/Sink Impact in Semi-Infinite Porous Medium
Mathematical models for pollutant transport in semi-infinite aquifers are based on the advection-dispersion equation (ADE) and its variants. This study employs the ADE incorporating time-dependent dispersion and velocity and space-time dependent source and sink, expressed by one function. The dispersion theory allows mechanical dispersion to be directly proportional to seepage velocity. Initial...
متن کاملA MULTISTAGE EXPANSION PLANNING METHOD FOR OPTIMAL SUBSTATION PLACEMENT
Optimal distribution substation placement is one of the major components of optimal distribution system planning projects. In this paper optimal substation placement problem is solved using Imperialist Competitive Algorithm (ICA) as a new developed heuristic optimization algorithm. This procedure gives the optimal size, site and installation time of medium voltage substation, using their relate...
متن کاملA tool for implementing action graphs
We describe a specification tool for action graphs, which allows the user to naturally switch between between the syntactic and graphical presentations. The implementation includes a general matching algorithm for identifying redexes in a graph, and for animating reductions.
متن کاملAn approach to Improve Particle Swarm Optimization Algorithm Using CUDA
The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...
متن کامل